Text Clustering Incremental Algorithm in Sensitive Topic Detection
نویسندگان
چکیده
منابع مشابه
Text clustering for topic detection
The world wide web represents vast stores of information. However, the sheer amount of such information makes it practically impossible for any human user to be aware of much of it. Therefore, it would be very helpful to have a system that automatically discovers relevant, yet previously unknown information, and reports it to users in human-readable form. As the first attempt to accomplish such...
متن کاملahp algorithm and un-supervised clustering in auto insurance fraud detection
this thesis is a study on insurance fraud in iran automobile insurance industry and explores the usage of expert linkage between un-supervised clustering and analytical hierarchy process(ahp), and renders the findings from applying these algorithms for automobile insurance claim fraud detection. the expert linkage determination objective function plan provides us with a way to determine whi...
15 صفحه اولAn Incremental Feature Clustering Algorithm for Text Classification
Text classification is a challenging task due to the large dimensionality of the feature vector. To alleviate this problem, feature reduction techniques are applied for reducing the amount of time and complexity for text classification. In this paper, we propose a novel fuzzy self constructing algorithm for feature clustering. Feature clustering is a feature reduction method which drastically r...
متن کاملTrend-based Document Clustering for Sensitive and Stable Topic Detection
The ability to detect new topics and track them is important given the huge amounts of documents. This paper introduces a trend-based document clustering algorithm for analyzing them. Its key characteristic is that it gives scores to words on the basis of the fluctuation in word frequency. The algorithm generates clusters in a practical time, with O(n) processing cost due to preliminary calcula...
متن کاملA Fast Incremental Clustering Algorithm
Clustering has played a very important role in data mining. In this paper, a fast incremental clustering algorithm is proposed by changing the radius threshold value dynamically. The algorithm restricts the number of the final clusters and reads the original dataset only once. At the same time an inter-cluster dissimilarity measure taking into account the frequency information of the attribute ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information and Communication Sciences
سال: 2018
ISSN: 2575-1700
DOI: 10.11648/j.ijics.20180303.12